Communicating Hierarchical State Machines

نویسندگان

  • Rajeev Alur
  • Sampath Kannan
  • Mihalis Yannakakis
چکیده

Hierarchical state machines are nite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very little is known concerning their complexity and expressiveness. In this paper, we study these questions for hierarchical state machines as well as for communicating hierarchical state machines, that is, nite state machines extended with both hierarchy and concurrency. We present a comprehensive set of results characterizing (1) the complexity of the reachability, emptiness and universality problems, (2) the complexity of the language inclusion and equivalence problems, and (3) the succinctness relationships between different types of machines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Test Selection for Hierarchical and Communicating Finite State Machines

oracles may be used instead of characterization sets to check the precise or abstract state, respectively, of the cor-

متن کامل

Principles of Transforming Communicating X-Machines to Population P Systems

Population P Systems is a class of P Systems in which cells are arranged in a graph rather than a hierarchical structure. On the other hand, Communicating X-machines are state-based machines, extended with a memory structure and transition functions instead of simple inputs, which communicate via message passing. One could use Communicating X-machines to create system models built out of compon...

متن کامل

Hierarchical Communicating Real-Time State Machines

This paper proposes a methodology for the development of distributed real-time (RT) systems using the Communicating Real-Time State Machines (CRSMs) formal specification language. The methodology is novel in that it addresses complex systems by extending CRSMs with concepts borrowed from Statecharts, and favours timing predictability through a holistic integration of an RT system and its operat...

متن کامل

Specification of Control Flow Properties for Verification of Synthesized VHDL Designs

Behavioral speciications in VHDL contain multiple communicating processes. Register level designs synthesized from these speciications contain a data path represented as a netlist and a controller consisting of multiple communicating synchronous nite state machines. These nite state machines together implement the control ow speciied in and implied by the behavioral speciication in VHDL. This p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999